Универсальный англо-русский словарь. Академик.ру. 2011.
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia
Determinization of Automaton — In theoretical computer science and automata theory, determinizing a non deterministic automaton is a very important procedure. This procedure accepts a non deterministic automaton of some type and returns another deterministic automaton that… … Wikipedia
Powerset construction — In the theory of computation and Automata theory, the powerset construction or subset construction is a standard method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same … Wikipedia
